Alternating orientation and alternating colouration of perfect graphs
نویسندگان
چکیده
منابع مشابه
Alternating Graphs
In this paper we generalize the concept of alternating knots to alternating graphs and show that every abstract graph has a spatial embedding that is alternating. We also prove that every spatial graph is a subgraph of an alternating graph. We define n-composition for spatial graphs and generalize the results of Menasco on alternating knots to show that an alternating graph is n-composite for n...
متن کاملUni-directional Alternating Group Graphs
A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one ...
متن کاملAlternating cycles in soliton graphs
Soliton graphs having an alternating cycle are characterized with the help of a shrinking procedure. This characterization leads to a method testing the existence of an alternating cycle in a soliton graph. The suggested algorithm runs in O(n3) time, where n is the number of vertices in the graph. Key-Words: Combinatorial Problems, Graph Matchings, Alternating cycles, Soliton graphs, 1-extendab...
متن کاملALTERNATING KNOTS, PLANAR GRAPHS AND q-SERIES
Recent advances in Quantum Topology assign q-series to knots in at least three different ways. The q-series are given by generalized Nahm sums (i.e., special qhypergeometric sums) and have unknown modular and asymptotic properties. We give an efficient method to compute those q-series that come from planar graphs (i.e., reduced Tait graphs of alternating links) and compute several terms of thos...
متن کاملPanpositionable hamiltonicity of the alternating group graphs
The alternating group graph AGn is an interconnection network topology based on the Cayley graph of the alternating group. There are some interesting results concerning the hamiltonicity and the fault tolerant hamiltonicity of the alternating group graphs. In this article, we propose a new concept called panpositionable hamiltonicity. A hamiltonian graph G is panpositionable if for any two diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1987
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90045-1